Parsing Ambiguous Structures Using Controlled Disjunctions and Unary Quasi-Trees

doi 10.3115/980845.980866
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Parsing Ambiguous Structures Using Controlled Disjunctions and Unary Quasi-Trees

1998English

On Safety of Unary and Non-Unary IFP-operators

Modeling and Analysis of Information Systems
2018English

Limited Automata and Unary Languages

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2019English

On Classes of Structures Axiomatizable by Universal D-Horn Sentences and Universal Positive Disjunctions

Algebra Universalis
Number TheoryLogicAlgebra
2018English

The Harmonic Index of Two-Trees and Quasi-Tree Graphs

Journal of Mathematical Inequalities
Analysis
2019English

Standard Unary Algebras

English

The Representation of Constituent Structures for Finite-State Parsing

1984English

Island Grammar-Based Parsing Using GLL and Tom

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Extracting Sense Trees From the Romanian Thesaurus by Sense Segmentation & Dependency Parsing

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy