Giorgio Satta

Comput. Linguistics, 2011

Computation of Infix Probabilities for Probabilistic Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, 2011

Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing.

[BibT_eX]

[DOI]

Shay B. Cohen

Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, 2011

Prefix Probability for Probabilistic Synchronous Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

Dynamic Programming Algorithms for Transition-Based Dependency Parsers.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

2010

Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar.

[BibT_eX]

[DOI]

Rebecca Nesson

Stuart M. Shieber

Comput. Linguistics, 2010

Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, 2010

Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two.

[BibT_eX]

[DOI]

Benoît Sagot

Proceedings of the ACL 2010, 2010

Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers.

[BibT_eX]

[DOI]

Andreas Maletti

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

The Importance of Rule Restrictions in CCG.

[BibT_eX]

[DOI]

Alexander Koller

Proceedings of the ACL 2010, 2010

2009

Discovering subword associations in strings in time linear in the output size.

[BibT_eX]

[DOI]

Alberto Apostolico

J. Discrete Algorithms, 2009

Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems.

[BibT_eX]

[DOI]

David J. Weir

Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, May 31, 2009

Parsing Algorithms based on Tree Automata.

[BibT_eX]

[DOI]

Andreas Maletti

Proceedings of the 11th International Workshop on Parsing Technologies (IWPT-2009), 2009

Synchronous Rewriting in Treebanks.

[BibT_eX]

[DOI]

Laura Kallmeyer

Wolfgang Maier

Proceedings of the 11th International Workshop on Parsing Technologies (IWPT-2009), 2009

Treebank Grammar Techniques for Non-Projective Dependency Parsing.

[BibT_eX]

[DOI]

Proceedings of the EACL 2009, 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, Athens, Greece, March 30, 2009

A Polynomial-Time Parsing Algorithm for TT-MCTAG.

[BibT_eX]

[DOI]

Laura Kallmeyer

Proceedings of the ACL 2009, 2009

An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two.

[BibT_eX]

[DOI]

Proceedings of the ACL 2009, 2009

2008

Probabilistic Parsing.

[BibT_eX]

[DOI]

Proceedings of the New Developments in Formal Languages and Applications, 2008

Computation of distances for regular and context-free probabilistic languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Comparing Italian parsers on a common Treebank: the EVALITA experience.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Language Resources and Evaluation, 2008

Optimal <i>k</i>-arization of Synchronous Tree-Adjoining Grammar.

[BibT_eX]

[DOI]

Rebecca Nesson

Stuart M. Shieber

Proceedings of the ACL 2008, 2008

2007

Probabilistic Context-Free Grammars Estimated from Infinite Distributions.

[BibT_eX]

[DOI]

Anna Corazza

IEEE Trans. Pattern Anal. Mach. Intell., 2007

On the Complexity of Non-Projective Data-Driven Dependency Parsing.

[BibT_eX]

[DOI]

Ryan T. McDonald

Proceedings of the Tenth International Conference on Parsing Technologies, 2007

Guided Learning for Bidirectional Sequence Classification.

[BibT_eX]

[DOI]

Libin Shen

Aravind K. Joshi

Proceedings of the ACL 2007, 2007

2006

Probabilistic parsing strategies.

[BibT_eX]

[DOI]

J. ACM, 2006

Estimation of Consistent Probabilistic Context-free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, 2006

Cross-Entropy and Estimation of Probabilistic Context-Free Grammars.

[BibT_eX]

[DOI]

Anna Corazza

Proceedings of the Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, 2006

Factoring Synchronous Grammars by Sorting.

[BibT_eX]

[DOI]

Daniel Gildea

Hao Zhang

Proceedings of the ACL 2006, 2006

2005

Some Computational Complexity Results for Synchronous Context-Free Grammars.

[BibT_eX]

[DOI]

Enoch Peserico

Proceedings of the HLT/EMNLP 2005, 2005

2004

IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2004

The language intersection problem for non-recursive context-free grammars.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Tabular Parsing

[BibT_eX]

[DOI]

CoRR, 2004

Optimal Discovery of Subword Associations in Strings.

[BibT_eX]

[DOI]

Alberto Apostolico

Cinzia Pizzi

Proceedings of the Discovery Science, 7th International Conference, 2004

Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the COLING 2004, 2004

An Alternative Method of Training Probabilistic LR Parsers.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, 2004

Generalized Multitext Grammars.

[BibT_eX]

[DOI]

I. Dan Melamed

Benjamin Wellington

Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, 2004

2003

Efficient text fingerprinting via Parikh mapping.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing.

[BibT_eX]

[DOI]

Stuart M. Shieber

Proceedings of the Eighth International Conference on Parsing Technologies, 2003

Probabilistic Parsing as Intersection.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Parsing Technologies, 2003

2002

Parsing non-recursive CFGs.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, 2002

2000

A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars.

[BibT_eX]

[DOI]

Jason Eisner

Proceedings of the Fifth International Workshop on Tree Adjoining Grammar and Related Frameworks, 2000

Parsing Techniques for Lexicalized Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Sixth Internatonal Workshop on Parsing Technologies, 2000

Bringing Information Extraction out of the Labs: the NoName Environment.

[BibT_eX]

Fabio Ciravegna

Alberto Lavelli

Proceedings of the ECAI 2000, 2000

Left-To-Right Parsing and Bilexical Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 6th Applied Natural Language Processing Conference, 2000

1999

Independent Parallelism in Finite Copying Parallel Rewriting Systems.

[BibT_eX]

[DOI]

Owen Rambow

Theor. Comput. Sci., 1999

Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars.

[BibT_eX]

[DOI]

Jason Eisner

Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics, 1999

1998

Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Optimality Theory and the Generative Complexity of Constraint Violability.

[BibT_eX]

Robert Frank

Comput. Linguistics, 1998

Prefix probabilities for linear indexed grammars.

[BibT_eX]

[DOI]

Anoop Sarkar

Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, 1998

Restrictions on Tree Adjoining Languages.

[BibT_eX]

[DOI]

William Schuler

Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, 1998

Prefix Probabilities from Stochastic Tree Adjoining Grammars.

[BibT_eX]

[DOI]

Anoop Sarkar

Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, 1998

1997

A Variant of Earley Parsing.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 97: Advances in Artificial Intelligence, 1997

String Transformation Learning.

[BibT_eX]

[DOI]

John C. Henderson

Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, 1997

1996

Symbol-Relation Grammars: A Formalism for Graphical Languages.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Efficient Transformation-Based Parsing.

[BibT_eX]

[DOI]

Eric Brill

Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, 1996

Synchronous Models of Language.

[BibT_eX]

[DOI]

Owen Rambow

Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, 1996

Efficient Tabular LR Parsing.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, 1996

1995

The Membership Problem for Unordered Vector Languages.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1994

Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1994

Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication.

[BibT_eX]

Comput. Linguistics, 1994

Bidirectional Context-Free Grammar Parsing for Natural Language Processing.

[BibT_eX]

[DOI]

Artif. Intell., 1994

A Rank Hierarchy for Determinsitic Tree-Walking Transducers.

[BibT_eX]

[DOI]

Owen Rambow

Proceedings of the Trees in Algebra and Programming, 1994

An Extended Theory of Head-Driven Parsing.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, 1994

1993

Language modeling using stochastic context-free grammars.

[BibT_eX]

[DOI]

Speech Commun., 1993

1992

Recognition of Linear Context-Free Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, 28 June, 1992

Computation of Upper-Bounds for Stochastic Context-Free Languages.

[BibT_eX]

[DOI]

Anna Corazza

Renato de Mori

Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991

Computation of Probabilities for an Island-Driven Parser.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1991

Computation of upper-bounds for island-driven stochastic parsers.

[BibT_eX]

[DOI]

Proceedings of the Second European Conference on Speech Communication and Technology, 1991

Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars.

[BibT_eX]

[DOI]

Alberto Lavelli

Proceedings of the EACL 1991, 1991

A Tabular Method for Island-Driven Context-Free Grammar Parsing.

[BibT_eX]

[DOI]

Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990

Computation of probabilities for island-driven parsers.

[BibT_eX]

[DOI]

Proceedings of the First International Conference on Spoken Language Processing, 1990

A Computational Approach to Binding Theory.

[BibT_eX]

[DOI]

Alessandra Giorgi

Fabio Pianesi

Proceedings of the 13th International Conference on Computational Linguistics, 1990

1989

Head-Driven Bidirectional Parsing: A Tabular Method.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Parsing Technologies, 1989

Formal Properties and Implementation of Bidirectional Charts.

[BibT_eX]

[DOI]