Add to ORKGWe present a left to right incremental algorithm for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly predicts a wide variety of performance phenomena: garden pathing, left to right quantifier scope preference, centre embedding unacceptability, preference for lower attachment, and heavy noun phrase shift.Postprint (published version
AbstractWe present here a stochastic point of vue on Lambek Categorial Grammars which have shown the...
Incremental parsers have potential advantages for applications like language modeling for machine tr...
This work is the outcome of a research in the use of Categorial Grammars (CG) for the description an...
We present a left to right incremental algorithm for the processing of Lambek categorial grammar by ...
The paper describes a parser for Categorial Grammar which provides fully word by word incremental in...
This dissertation investigates which grammar formalism to use for representing the structure of natu...
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as l...
A revised version will appear in a volume in honour of Lambek 90th birthdayInternational audienceIn ...
AbstractThis article presents an overview of a framework called categorial grammars from a theoretic...
Girard (1987) introduced proof nets as a syntax of linear proofs which eliminates inessential rule ...
Incremental parsers have potential advantages for applications like language modeling for machine tr...
Syntactically-enriched language models (parsers) constitute a promising component in applications su...
We propose to represent the syntax and semantics of natural languages with labelled proof nets in th...
In Moortgat 1996 the Lambek Calculus L (Lambek 1958) is extended by a pair of residuation modalities...
We illustrate the potential for geometry of language and linguistic circuitry under the rendering of...
AbstractWe present here a stochastic point of vue on Lambek Categorial Grammars which have shown the...
Incremental parsers have potential advantages for applications like language modeling for machine tr...
This work is the outcome of a research in the use of Categorial Grammars (CG) for the description an...
We present a left to right incremental algorithm for the processing of Lambek categorial grammar by ...
The paper describes a parser for Categorial Grammar which provides fully word by word incremental in...
This dissertation investigates which grammar formalism to use for representing the structure of natu...
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as l...
A revised version will appear in a volume in honour of Lambek 90th birthdayInternational audienceIn ...
AbstractThis article presents an overview of a framework called categorial grammars from a theoretic...
Girard (1987) introduced proof nets as a syntax of linear proofs which eliminates inessential rule ...
Incremental parsers have potential advantages for applications like language modeling for machine tr...
Syntactically-enriched language models (parsers) constitute a promising component in applications su...
We propose to represent the syntax and semantics of natural languages with labelled proof nets in th...
In Moortgat 1996 the Lambek Calculus L (Lambek 1958) is extended by a pair of residuation modalities...
We illustrate the potential for geometry of language and linguistic circuitry under the rendering of...
AbstractWe present here a stochastic point of vue on Lambek Categorial Grammars which have shown the...
Incremental parsers have potential advantages for applications like language modeling for machine tr...
This work is the outcome of a research in the use of Categorial Grammars (CG) for the description an...