Johan Bos
Biographic Data
| ID | 5074396 |
|---|---|
| NAME | Johan Bos |
| GIVEN NAMES | Johan |
| FAMILY NAME | Bos |
| SIGNATURE | BOS J |
| AFFILIATIONS | University of Groningen, Center for Language and Cognition. [email protected] |
| VERIFIED | No |
| TOTAL WORKS | 6 |
| TOTAL CITATIONS | 5 |
| AUTHOR COUNT | 6 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2003 |
| LATEST PUBLICATION YEAR | 2024 |
| H-INDEX | 2 |
Neural Semantic Parsing with Extremely Rich Symbolic Meaning Representations
Current open-domain neural semantics parsers show impressive performance. However, closer inspection of the symbolic meaning representations they produce reveals significant weaknesses: Sometimes they tend to merely copy character sequences from the source text to form symbolic concepts, defaulting to the most frequent word sense based in the training distribution. By leveraging the hierarchical structure of a lexical ontology, we introduce a nov…
Universal Discourse Representation Structure Parsing
We consider the task of crosslingual semantic parsing in the style of Discourse Representation Theory (DRT) where knowledge from annotated corpora in a resource-rich language is transferred via bitext to guide learning in other languages. We introduce Universal Discourse Representation Theory (UDRT), a variant of DRT that explicitly anchors semantic representations to tokens in the linguistic input. We develop a semantic parsing framework based o…
Discourse Semantics with Information Structure
The property of projection poses a challenge to formal semantic theories, due to its apparent non-compositional nature. Projected content is therefore typically analyzed as being different from and independent of asserted content. Recent evidence, however, suggests that these types of content in fact closely interact, thereby calling for a more integrated analysis that captures their similarities, while respecting their differences. Here, we prop…
Expressive Power of Abstract Meaning Representations
The syntax of abstract meaning representations (AMRs) can be defined recursively, and a systematic translation to first-order logic (FOL) can be specified, including a proper treatment of negation. AMRs without recurrent variables are in the decidable two-variable fragment of FOL. The current definition of AMRs has limited expressive power for universal quantification (up to one universal quantifier per sentence). A simple extension of the AMR sy…
A Survey of Computational Semantics: Representation, Inference and Knowledge in Wide‐Coverage Text Understanding
The aim of computational semantics is to capture the meaning of natural language expressions in representations suitable for performing inferences, in the service of understanding human language in written or spoken form. First‐order logic is a good starting point, both from the representation and inference point of view. But even if one makes the choice of first‐order logic as representation language, this is not enough: the computational semant…
Implementing the Binding and Accommodation Theory for Anaphora Resolution and Presupposition Projection
Computational aspects of Van der Sandt's binding and accommodation theory (BAT) for presupposition projection and anaphora resolution are presented and discussed in this article. BAT is reformulated to meet requirements for computational implementation, which include operations on discourse representation structures (renaming and merging), the representation of presuppositions (allowing for selective binding and determining free and bound variabl…
Implementing the Binding and Accommodation Theory for Anaphora Resolution and Presupposition Projection
Computational aspects of Van der Sandt's binding and accommodation theory (BAT) for presupposition projection and anaphora resolution are presented and discussed in this article. BAT is reformulated to meet requirements for computational implementation, which include operations on discourse representation structures (renaming and merging), the representation of presuppositions (allowing for selective binding and determining free and bound variabl…
A Survey of Computational Semantics: Representation, Inference and Knowledge in Wide‐Coverage Text Understanding
The aim of computational semantics is to capture the meaning of natural language expressions in representations suitable for performing inferences, in the service of understanding human language in written or spoken form. First‐order logic is a good starting point, both from the representation and inference point of view. But even if one makes the choice of first‐order logic as representation language, this is not enough: the computational semant…
Implementing the Binding and Accommodation Theory for Anaphora Resolution and Presupposition Projection
Computational aspects of Van der Sandt's binding and accommodation theory (BAT) for presupposition projection and anaphora resolution are presented and discussed in this article. BAT is reformulated to meet requirements for computational implementation, which include operations on discourse representation structures (renaming and merging), the representation of presuppositions (allowing for selective binding and determining free and bound variabl…
A Survey of Computational Semantics: Representation, Inference and Knowledge in Wide‐Coverage Text Understanding
The aim of computational semantics is to capture the meaning of natural language expressions in representations suitable for performing inferences, in the service of understanding human language in written or spoken form. First‐order logic is a good starting point, both from the representation and inference point of view. But even if one makes the choice of first‐order logic as representation language, this is not enough: the computational semant…
Expressive Power of Abstract Meaning Representations
The syntax of abstract meaning representations (AMRs) can be defined recursively, and a systematic translation to first-order logic (FOL) can be specified, including a proper treatment of negation. AMRs without recurrent variables are in the decidable two-variable fragment of FOL. The current definition of AMRs has limited expressive power for universal quantification (up to one universal quantifier per sentence). A simple extension of the AMR sy…
Discourse Semantics with Information Structure
The property of projection poses a challenge to formal semantic theories, due to its apparent non-compositional nature. Projected content is therefore typically analyzed as being different from and independent of asserted content. Recent evidence, however, suggests that these types of content in fact closely interact, thereby calling for a more integrated analysis that captures their similarities, while respecting their differences. Here, we prop…
Universal Discourse Representation Structure Parsing
We consider the task of crosslingual semantic parsing in the style of Discourse Representation Theory (DRT) where knowledge from annotated corpora in a resource-rich language is transferred via bitext to guide learning in other languages. We introduce Universal Discourse Representation Theory (UDRT), a variant of DRT that explicitly anchors semantic representations to tokens in the linguistic input. We develop a semantic parsing framework based o…
Neural Semantic Parsing with Extremely Rich Symbolic Meaning Representations
Current open-domain neural semantics parsers show impressive performance. However, closer inspection of the symbolic meaning representations they produce reveals significant weaknesses: Sometimes they tend to merely copy character sequences from the source text to form symbolic concepts, defaulting to the most frequent word sense based in the training distribution. By leveraging the hierarchical structure of a lexical ontology, we introduce a nov…
Computer Science (6 works) · Natural Language Processing Techniques (6 works) · Artificial Intelligence (5 works) · Linguistics (4 works) · Natural language processing (4 works) · Philosophy (4 works) · Topic Modeling (4 works) · Philosophy (3 works) · Programming language (3 works) · Psychology (3 works)