Related Topics
Experts

1

2

3

4

5

6

7

8

9

10
Publications (33)

1A Robust Parser Based on Syntactic Information1: SCAN processing deletion, and mutation errors of terminal symbols. The objective of this algorithm is to parse input...

2Chinese Numbers, MIX, Scrambling, and Concatenation Grammars Range1999  Pierre Boullipredicate names, T and V are finite, disjoint sets of terminal symbols and variable symbols respectively, S E N is the start...

3Fast Full Parsing by LinearChain Conditional Random Fieldsphrases, and converts the identified phrases to nonterminal symbols. It then performs chunking for the updated sequence...

4Manually constructed contextfree grammar for Myanmar syllable structure2012  Tin Htay Hlaingtopmost row represents terminal symbols whereas the leftmost column represents the non terminal symbols. The entries in the...

5The Recognition Capacity Of Local Syntactic Constraints1991  Mori Rimonthe tag set T  the set of wordclass tags used as terminal symbols in a given grammar G. Typically, M=N, but in a more...

6Parsing the Wall Street Journal with the InsideOutside Algorithm(X i ~ tin) with very low • probability for all nonterminal symbols. This case will not happen if the training is repr...

7Stochastic HPSG1995  Chris Brew> , where W is a Set of terminal symbols {wl, . . . , w~}, N is a set of nonterminal symbols {N1, . . . ,N~}, N1 is...

8Talking About Treesthe set of nonterminal symbols, is {S, NP, VP, N, V, DET, CONJ }; where T, the set of terminal symbols, is {the, a, man...

9Making Tree Kernels Practical for Natural Language Learning2006  Alessandro Moschittirighthand side are associated with its children. The terminal symbols of the grammar are always associated with the leaves...

10XMG  An Expressive Formalism for Describing TreeBased Grammarsa Definite Clause Grammar (or DCG). In this DCG, the terminal symbols are descriptions. To extend the approach to the re...