ID: cmp-lg/9505019

Measuring semantic complexity

May 8, 1995

View on ArXiv

Similar papers 5

Measuring algorithmic interpretability: A human-learning-based framework and the corresponding cognitive complexity score

May 20, 2022

83% Match
John P. Lalor, Hong Guo
Artificial Intelligence

Algorithmic interpretability is necessary to build trust, ensure fairness, and track accountability. However, there is no existing formal measurement method for algorithmic interpretability. In this work, we build upon programming language theory and cognitive load theory to develop a framework for measuring algorithmic interpretability. The proposed measurement framework reflects the process of a human learning an algorithm. We show that the measurement framework and the res...

Find SimilarView on arXiv

A Data-Oriented Approach to Semantic Interpretation

June 18, 1996

82% Match
Rens University of Amsterdam Bod, Remko University of Amsterdam Bonnema, Remko University of Amsterdam Scha
Computation and Language

In Data-Oriented Parsing (DOP), an annotated language corpus is used as a stochastic grammar. The most probable analysis of a new input sentence is constructed by combining sub-analyses from the corpus in the most probable way. This approach has been succesfully used for syntactic analysis, using corpora with syntactic annotations such as the Penn Treebank. If a corpus with semantically annotated sentences is used, the same approach can also generate the most probable semanti...

Find SimilarView on arXiv

An in-between "implicit" and "explicit" complexity: Automata

January 31, 2015

82% Match
Clément LACL Aubert
Logic in Computer Science
Computational Complexity
Logic

Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory contributed to complexity with a machine-dependant with implicit bounds model.

Find SimilarView on arXiv

Having Your Cake and Eating It Too: Autonomy and Interaction in a Model of Sentence Processing

August 31, 1994

82% Match
Kurt P. College of Computing, Georgia Tech Eiselt, Kavi College of Computing, Georgia Tech Mahesh, Jennifer K. Dept. of Psychology, Albion College Holbrook
Computation and Language

Is the human language understander a collection of modular processes operating with relative autonomy, or is it a single integrated process? This ongoing debate has polarized the language processing community, with two fundamentally different types of model posited, and with each camp concluding that the other is wrong. One camp puts forth a model with separate processors and distinct knowledge sources to explain one body of data, and the other proposes a model with a single ...

Find SimilarView on arXiv

Machine Reading with Background Knowledge

December 16, 2016

82% Match
Ndapandula Nakashole, Tom M. Mitchell
Artificial Intelligence
Computation and Language

Intelligent systems capable of automatically understanding natural language text are important for many artificial intelligence applications including mobile phone voice assistants, computer vision, and robotics. Understanding language often constitutes fitting new information into a previously acquired view of the world. However, many machine reading systems rely on the text alone to infer its meaning. In this paper, we pursue a different approach; machine reading methods th...

Find SimilarView on arXiv

Natural Language Understanding Based on Semantic Relations between Sentences

December 19, 2012

82% Match
Hyeok Kong
Computation and Language

In this paper, we define event expression over sentences of natural language and semantic relations between events. Based on this definition, we formally consider text understanding process having events as basic unit.

Find SimilarView on arXiv

Architectures of Meaning, A Systematic Corpus Analysis of NLP Systems

July 16, 2021

82% Match
Oskar Wysocki, Malina Florea, ... , Freitas Andre
Computation and Language
Artificial Intelligence

This paper proposes a novel statistical corpus analysis framework targeted towards the interpretation of Natural Language Processing (NLP) architectural patterns at scale. The proposed approach combines saturation-based lexicon construction, statistical corpus analysis methods and graph collocations to induce a synthesis representation of NLP architectural patterns from corpora. The framework is validated in the full corpus of Semeval tasks and demonstrated coherent architect...

Find SimilarView on arXiv

Meaning and understanding in large language models

October 26, 2023

82% Match
Vladimír Havlík
Computation and Language

Can a machine understand the meanings of natural language? Recent developments in the generative large language models (LLMs) of artificial intelligence have led to the belief that traditional philosophical assumptions about machine understanding of language need to be revised. This article critically evaluates the prevailing tendency to regard machine language performance as mere syntactic manipulation and the simulation of understanding, which is only partial and very shall...

Find SimilarView on arXiv

Techniques for Deep Query Understanding

May 19, 2015

82% Match
Abhay Prakash, Dhaval Patel
Information Retrieval

Query Understanding concerns about inferring the precise intent of search by the user with his formulated query, which is challenging because the queries are often very short and ambiguous. The report discusses the various kind of queries that can be put to a Search Engine and illustrates the Role of Query Understanding for return of relevant results. With different advances in techniques for deep understanding of queries as well as documents, the Search Technology has witnes...

Find SimilarView on arXiv

From Frequency to Meaning: Vector Space Models of Semantics

March 4, 2010

82% Match
Peter D. Turney, Patrick Pantel
Computation and Language
Information Retrieval
Machine Learning

Computers understand very little of the meaning of human language. This profoundly limits our ability to give instructions to computers, the ability of computers to explain their actions to us, and the ability of computers to analyse and process text. Vector space models (VSMs) of semantics are beginning to address these limits. This paper surveys the use of VSMs for semantic processing of text. We organize the literature on VSMs according to the structure of the matrix in a ...

Find SimilarView on arXiv