Related Topics
Experts

1

2

3

4

5

6

7

8

9

10
Publications (139)

1Efficient NormalForm Parsing for Combinatory Categorial Grammar1996  Jason EisnerEfficient NormalForm Parsing for Combinatory Categorial Grammar* Jason Eisner Dept. of Computer and Informat ion Science...

2A Logical Basis for the D Combinator and Normal Form in CCG2008  Frederick Hoyt,Jason BaldridgeLinguistics A Logical Basis for the D Combinator and Normal Form in CCG Frederick Hoyt and Jason Baldridge The Department...

3Parsing the WSJ Using CCG and LogLinear Models2004  Stephen Clark,James R. Curranderivations, including nonstandard derivations, with normalform models. The performances of the two models are comparable...

4Using Mazurkiewicz Trace Languages for PartitionBased Morphology2007  François Barthélemyconnected. A string x is said to be in lexicographic normal form if x is the smallest string of its equivalence class [x]...

5Maximal Incrementality in Linear Categorial Deduction1997  Mark Heppleproblem involves specifying a normal form for deductions, and allowing that only normal form proofs are constructed) Our route...

6Parsing As Natural Deduction1989  Esther Konigparsing method, we show the existence of "relative" normal form proof trees and make use of their properties to constrain...

7Relating Probabilistic Grammars and Automataincluding proofs that any PCFG can be put in Chomsky normal form, that weights can be renormalized to ensure that the...

8Denormalization And Cross Referencing In Theoretical Lexicography1984  Joseph E. Grimesinformation structure by partitioning it into a set of normal form relations. It can be presented to the user, however, in...

9An Efficient Parsing Algorithm For Tree Adjoining Grammars1990  Harbusch, Karinproven that each TAG can be transformed into two form, a normal form restricting the outdegree of a node to be less three. ...

10Deriving the PredicateArgument Structure for a Free Word Order Language1998  Cem Bozsahincompositions that are essential to our method. Other normal form parsers, e.g. that of Hepple and Morrill (1989), have...