diff --git a/dist/bundle.ie.js b/dist/bundle.ie.js
index 6755aaa5b..c1071cf6b 100644
--- a/dist/bundle.ie.js
+++ b/dist/bundle.ie.js
@@ -81708,7 +81708,7 @@ BI.AbstractTreeValueChooser = BI.inherit(BI.Widget, {
 
         function isSearchValueInParent(parentValues) {
             for (var i = 0, len = parentValues.length; i < len; i++) {
-                if (self._isMatch(parentValues.slice(0, parentValues.length - 1 - i), parentValues[i], keyword)) {
+                if (self._isMatch(parentValues.slice(0, i), parentValues[i], keyword)) {
                     return true;
                 }
             }
diff --git a/dist/bundle.js b/dist/bundle.js
index 784c65f1b..3c816eb41 100644
--- a/dist/bundle.js
+++ b/dist/bundle.js
@@ -82112,7 +82112,7 @@ BI.AbstractTreeValueChooser = BI.inherit(BI.Widget, {
 
         function isSearchValueInParent(parentValues) {
             for (var i = 0, len = parentValues.length; i < len; i++) {
-                if (self._isMatch(parentValues.slice(0, parentValues.length - 1 - i), parentValues[i], keyword)) {
+                if (self._isMatch(parentValues.slice(0, i), parentValues[i], keyword)) {
                     return true;
                 }
             }
diff --git a/dist/fineui.ie.js b/dist/fineui.ie.js
index ab5ca0a48..c0df52f26 100644
--- a/dist/fineui.ie.js
+++ b/dist/fineui.ie.js
@@ -81950,7 +81950,7 @@ BI.AbstractTreeValueChooser = BI.inherit(BI.Widget, {
 
         function isSearchValueInParent(parentValues) {
             for (var i = 0, len = parentValues.length; i < len; i++) {
-                if (self._isMatch(parentValues.slice(0, parentValues.length - 1 - i), parentValues[i], keyword)) {
+                if (self._isMatch(parentValues.slice(0, i), parentValues[i], keyword)) {
                     return true;
                 }
             }
diff --git a/dist/fineui.js b/dist/fineui.js
index 744024757..9e1952233 100644
--- a/dist/fineui.js
+++ b/dist/fineui.js
@@ -82354,7 +82354,7 @@ BI.AbstractTreeValueChooser = BI.inherit(BI.Widget, {
 
         function isSearchValueInParent(parentValues) {
             for (var i = 0, len = parentValues.length; i < len; i++) {
-                if (self._isMatch(parentValues.slice(0, parentValues.length - 1 - i), parentValues[i], keyword)) {
+                if (self._isMatch(parentValues.slice(0, i), parentValues[i], keyword)) {
                     return true;
                 }
             }
diff --git a/dist/fineui_without_jquery_polyfill.js b/dist/fineui_without_jquery_polyfill.js
index 2a4736e62..e176745c1 100644
--- a/dist/fineui_without_jquery_polyfill.js
+++ b/dist/fineui_without_jquery_polyfill.js
@@ -65173,7 +65173,7 @@ BI.AbstractTreeValueChooser = BI.inherit(BI.Widget, {
 
         function isSearchValueInParent(parentValues) {
             for (var i = 0, len = parentValues.length; i < len; i++) {
-                if (self._isMatch(parentValues.slice(0, parentValues.length - 1 - i), parentValues[i], keyword)) {
+                if (self._isMatch(parentValues.slice(0, i), parentValues[i], keyword)) {
                     return true;
                 }
             }
diff --git a/dist/widget.js b/dist/widget.js
index a376b1557..ae84371f6 100644
--- a/dist/widget.js
+++ b/dist/widget.js
@@ -22710,7 +22710,7 @@ BI.AbstractTreeValueChooser = BI.inherit(BI.Widget, {
 
         function isSearchValueInParent(parentValues) {
             for (var i = 0, len = parentValues.length; i < len; i++) {
-                if (self._isMatch(parentValues.slice(0, parentValues.length - 1 - i), parentValues[i], keyword)) {
+                if (self._isMatch(parentValues.slice(0, i), parentValues[i], keyword)) {
                     return true;
                 }
             }
diff --git a/src/component/treevaluechooser/abstract.treevaluechooser.js b/src/component/treevaluechooser/abstract.treevaluechooser.js
index 7c3afee6e..b0821bda1 100644
--- a/src/component/treevaluechooser/abstract.treevaluechooser.js
+++ b/src/component/treevaluechooser/abstract.treevaluechooser.js
@@ -270,7 +270,7 @@ BI.AbstractTreeValueChooser = BI.inherit(BI.Widget, {
 
         function isSearchValueInParent(parentValues) {
             for (var i = 0, len = parentValues.length; i < len; i++) {
-                if (self._isMatch(parentValues.slice(0, parentValues.length - 1 - i), parentValues[i], keyword)) {
+                if (self._isMatch(parentValues.slice(0, i), parentValues[i], keyword)) {
                     return true;
                 }
             }