What is the translation of " PARSE TREE " in Chinese?

• 解析树
• 分析树

Examples of using Parse tree in English and their translations into Chinese

No parse tree is ever explicitly built.
从来没有解析树显式地构造出来。

Using the Step button, try to build a parse tree.
使用Step按钮，尝试建立一个分析树。

Many times the parse tree is not the final product.
很多时候解析树并不是最终产物。

These steps can be seen in the following parse tree.
这些步骤可以在下面的分析树中看到。

In many cases the parse tree is not the final product.
很多时候解析树并不是最终产物。

In this exercise you will manually construct some parse trees.
在本练习中，你将手动构造一些分析树。

In many cases the parse tree is not the final product.
很多时候，解析树还不是最终产品。

Implement a function that will convert a WFST in this form to a parse tree.
实现一个函数，将一个分析树的WFST转换成这种形式。

In many cases the parse tree is not the final product.
很多时候，解析树并不是最终结果。

The ANTLR parser recognizes the elements present in the source code and build a parse tree.
ANTLR解析器识别源码中的元素并构建解析树。

In figure 5 we built a parse tree from a mathematical expression.
在图5中，我们通过一个数学表达式建立了解析树。

Parse trees can be used to represent real-world constructions like sentences or mathematical expressions.
解析树常常用于真实世界的结构表示，例如句子或数学表达式。

In the following example, however, there is only one parse tree per sentence in the list.
在下面的例子中，链表中的每个句子只有一个分析树。

It works with your favorite parser to provide idiomatic ways of navigating, searching, and modifying the parse tree.
它与您最喜欢的解析器一起提供导航，搜索和修改解析树的习惯方法。

As you might have noticed, the parse trees for all of the sentences above look very similar.
你可能已经注意到了，上述所有句子的分析树看起来非常相似。

Beautiful Soup is an HTML/XML parser for Python that can turn even invalid markup into a parse tree.
BeautifulSoup是一种面向Python语言的HTML/XML解析器，它甚至可以将无效的标记转换为解析树。

This step generates a complete parse tree where each node represents an element of the compiled program.
最终，这一步会生成一个完整的分析树，其中每个结点表示编译后程序的一个元素。

X code by handling most of the incompatibilities which can be detected by parsing the source and traversing the parse tree.
X代码的工具，能够处理大部分通过解析源码并遍历解析树可检测到的不兼容问题。

In natural language processing(NLP), for example, parse trees are modeled as ordered, labeled trees..
在自然语言处理（NLP），例如，解析树被建模为有序，标记树。

The parse tree is also more suitable for supporting automated code refactoring, as it directly represents the original source code.
解析树也更适合于自动化配套代码重构，因为它直接代表着原始的源代码。

We can use the information from the dependency parse tree to automatically group together words that are all talking about the same thing.
我们可以用依存句法解析树中的信息，自动将所有讨论同一事物的单词分组在一起。

This parse tree shows us that the subject of the sentence is the noun“London” and it has a“be” relationship with“capital”.
这棵解析树告诉我们，句子的主语是名词「London」，它与「capital」有「be」关系。

We can use the information from the dependency parse tree to automatically group together words that are all talking about the same thing.
我们可以使用依赖解析树中的相关信息自动将所有讨论同一事物的单词组合在一起。

This parse tree shows us that the subject of the sentence is the noun“London” and it has a“be” relationship with“capital”.
这棵依存树告诉我们句子的主语是“London”，它和“capital”存在一个“be”的关系。

We will print these names out with the prettify() method in order to turn the Beautiful Soup parse tree into a nicely formatted Unicode string.
我们将使用prettify()方法打印这些名称，以便将“美丽的汤”解析树变成一个格式正确的Unicode字符串。

We can use it to search the parse tree for simple statements where the subject is“London” and the verb is a form of“be”.
我们可以用它来搜索解析树，用于简单的语句，其中主语是「London」，动词是「be」的形式。

This is because we follow the content-head principle, under which dependencies are drawn between content words, with function words becoming leaves in the parse tree.
这是因为我们遵循内容优先原则，依赖性会被画在内容词之间，功能词成为分析树的叶子。

He uses NLTK and the Stanford Parser to generate parse trees, and spaCy to generate dependency trees and perform named entity recognition.
他使用NLTK和StanfordParser生成解析树，并使用spaCy生成依赖树并执行命名实体识别。

BeautifulSoup is a library for parsing HTML/XML files, written in the Python programming language, which can even convert incorrect markup to a parsing tree.
BeautifulSoup是一种面向Python语言的HTML/XML解析器，它甚至可以将无效的标记转换为解析树。