Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,515
Parse Tree Notation
, 1994
"... Parse Tree Notation (PTN) facilitates the encoding of language translators which transform programs written in high level languages with extensions (e.g. a logic language with object oriented features) into equivalent programs in the original unextended languages (e.g. Prolog). PTN does this by offe ..."
Abstract
- Add to MetaCart
Parse Tree Notation (PTN) facilitates the encoding of language translators which transform programs written in high level languages with extensions (e.g. a logic language with object oriented features) into equivalent programs in the original unextended languages (e.g. Prolog). PTN does
Model Checking Parse Trees
"... Parse trees are fundamental syntactic structures in both computa-tional linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word according to a context-free grammar. We put forward the adequacy ..."
Abstract
- Add to MetaCart
Parse trees are fundamental syntactic structures in both computa-tional linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word according to a context-free grammar. We put forward
On compression of parse trees
, 2001
"... We consider methods for compressing parse trees, especially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of the path from the root of a tree to a node as the context of a node. The contexts are augmented with branching information of the nod ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
We consider methods for compressing parse trees, especially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of the path from the root of a tree to a node as the context of a node. The contexts are augmented with branching information
On Compression of Parse Trees
"... Abstract We consider methods for compressing parse trees, espe-cially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of thepath from the root of a tree to a node x as the context ofa node x. The contexts are augmented with branching in-formati ..."
Abstract
- Add to MetaCart
Abstract We consider methods for compressing parse trees, espe-cially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of thepath from the root of a tree to a node x as the context ofa node x. The contexts are augmented with branching in
Identifiability and unmixing of latent parse trees
- In Advances in Neural Information Processing Systems 25
, 2012
"... This paper explores unsupervised learning of parsing models along two directions. First, which models are identifiable from infinite data? We use a general technique for numerically checking identifiability based on the rank of a Jacobian matrix, and apply it to several stan-dard constituency and de ..."
Abstract
-
Cited by 15 (5 self)
- Add to MetaCart
and dependency parsing models. Second, for identifiable models, how do we estimate the parameters efficiently? EM suffers from local optima, while recent work using spectral methods [1] cannot be directly applied since the topology of the parse tree varies across sentences. We develop a strategy, unmixing, which
Treebased Translation without Using Parse Trees
"... Parse trees are indispensable to the existing tree-based translation models. However, there exist two major challenges in utilizing parse trees: 1) For most language pairs, it is hard to get parse trees due to the lack of syntactic resources for training. 2) Numerous parse trees are not compatible w ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Parse trees are indispensable to the existing tree-based translation models. However, there exist two major challenges in utilizing parse trees: 1) For most language pairs, it is hard to get parse trees due to the lack of syntactic resources for training. 2) Numerous parse trees are not compatible
Code and parse trees for lossless source encoding
- Communications in Information and Systems
, 2001
"... This paper surveys the theoretical literature on fixed-to-variable-length lossless source code trees, called code trees, and on variable-length-to-fixed lossless sounce code trees, called parse trees. Huffman coding [ l] is the most well known code tree problem, but there are a number of interestin ..."
Abstract
-
Cited by 62 (1 self)
- Add to MetaCart
This paper surveys the theoretical literature on fixed-to-variable-length lossless source code trees, called code trees, and on variable-length-to-fixed lossless sounce code trees, called parse trees. Huffman coding [ l] is the most well known code tree problem, but there are a number
Clustering by Tree Distance for Parse Tree
"... Abstract. The application of tree-distance to clustering is considered. Previous work identied some parameters which favourably affect the use of tree-distance in question-answering tasks. Some evidence is given that the same parameters favourably affect the cluster quality. A potential application ..."
Abstract
- Add to MetaCart
is in the creation of systems to carry out transformation of interrogative to indicative sentences, a rst step in a question-answering system. It is argued that the clustering provides a means to navigate the space of parses assigned to large question sets. A tree-distance analogue of vector-space notion of centroid
Abstract Automatic construction of parse trees for lexemes ∗
"... Recently, Dubé and Feeley presented a technique that makes lexical analyzers able to build parse trees for the lexemes that match regular expressions. While parse trees usually demonstrate how a word is generated by a context-free grammar, these parse trees demonstrate how a word is generated by a r ..."
Abstract
- Add to MetaCart
Recently, Dubé and Feeley presented a technique that makes lexical analyzers able to build parse trees for the lexemes that match regular expressions. While parse trees usually demonstrate how a word is generated by a context-free grammar, these parse trees demonstrate how a word is generated by a
Results 1 - 10
of
2,515
