Questions tagged [computational-linguistics]
24 questions
9
votes
3 answers
Context-free grammar for $L = \{a^{2^k}, k \in\mathbb{N}\}$
In an exercise, I am asked to find a context free grammar for language $L = \{a^{2^k}, k \in \mathbb{N}\}$.
I have been trying to use a "doubling" variable. If $a^{2n} \in L, n\in\mathbb{N}$ then use this variable to double the $a$'s that have been…
Dimitris Sfounis
- 225
- 2
- 9
6
votes
1 answer
Lambda calculus as the language of universal logic - connectives vs functions in lambda calculus?
I am reading http://okmij.org/ftp/gengo/applicative-symantics/AACG1.pdf and there is defined language TL (see last row in the table on page 4). It seems to me from this definition of TL, that lambda calculus is the language of universal logic - each…
TomR
- 1,411
- 8
- 17
5
votes
1 answer
Can lambda-calculus be used for knowledge representation?
Natural language semantics (in computational linguistics) uses lambda terms for expressing the semantics of natural language sentences. There is vast literature about combinatorial categorial grammars and lambda semantics of natural language, e.g.…
TomR
- 1,411
- 8
- 17
5
votes
0 answers
Is English Recursively enumerable?
The title says it all. I've tried digging up debate on this issue to see a proof one way or the other but it doesn't look like anyone is able to say whether or not it is. Clearly there are recursive structures in English, and that's about all anyone…
EthanLWillis
- 223
- 2
- 5
5
votes
3 answers
Word classification algorithms
I am looking for algorithms to classify words in a paragraph of text. I am particularly interested in a classification to determine if a certain word is noun, verb, etc., but also looking for any kind of word-classification algorithms. I am given a…
gen
- 991
- 1
- 8
- 15
4
votes
1 answer
Algorithm to find pronounciation rules
Suppose that you have a large dictionary with spellings and pronounciations of foreign words, and you want to find a set of pronunciation rules. They should have the simplest form: a sequence of letters to a sequence of sounds.
For example, in…
se0808
- 213
- 1
- 4
4
votes
3 answers
Correct term for “string consisting of words”
In a paper I am writing I want to make distinction between (1) string consisting of any characters and (2) string consisting of a chain of words from known language, with possible delimiters. My intuitive idea is to simply use string for meaning (1)…
Vilius Normantas
- 215
- 1
- 8
3
votes
0 answers
Why is part of speech tagging is closely related to word sense disambiguation?
It's written here Word Sense Disambiguation: A Structured Learning Perspective:
2.1 Basics of Word Sense Disambiguation
...the POS is usually provided before WSD. POS tagging is closely related to WSD, and POS tagging is a well-studied problem with…
R. S.
- 199
- 1
- 8
2
votes
0 answers
Induction / (machine learning) of Resource Grammars for Grammatical Framework?
Grammatical Framework is based in Abstract Categorial Grammars. It is known that Combinatory Categorial Grammars have grammar induction/learning capabilities see e.g. https://link.springer.com/article/10.1007/s11168-007-9026-2 and there are also…
TomR
- 1,411
- 8
- 17
2
votes
0 answers
Evaluation of annotation
I'm doing a research on NLG systems.
I need to annotate my corpus (~6 million words) automatically. My algorithm works well and I want to calculate Cohen's Kappa. What I cannot understand is the second annotator; I don't have the possibility to…
user57562
- 21
- 1
2
votes
1 answer
Trying to tag parts of a word and keep track of any changes that happen to those parts
I'm a researcher working with a language that has gone through phonological changes through time. I would like to tag parts of a word (i.e. prefix, stem, suffix) and then apply those phonological changes and then see what is left or different about…
user2743
- 121
- 1
2
votes
3 answers
How to use DFA/NFA to prove the language {$0^n 1^$ | x ∈ Σ*, n ≥ 1} is regular?
I'm trying to prove the language L = {$0^n 1^$ | x ∈ Σ*, n ≥ 1} is regular, but don't know how to present it in a DFA/NFA.
I'm thinking to have n+1 states in a NFA, with the start state as the accepting state. The NFA reada $0$s to go from q$0$ to…
Jaclyn
- 21
- 2
2
votes
0 answers
What's the meaning of linguistics?
In the programming language theory world, there are two important terminologies, i.e syntax, and semantics.
I can understand these two terminologies:
syntax is about sentence's structure (e.g. a valid sentence by some grammar)
semantics is about…
chansey
- 295
- 1
- 8
1
vote
0 answers
Combining Computer Science and Humanities
I currently hold a bachelors in Computer science and a masters in Art History. I really want to combine the two and I know of Digital Humanities but I'm not completely aware of where Digital Humanists could work besides Museums, libraries, etc. and…
dcs1
- 11
- 1
1
vote
1 answer
Where do transformational grammars stand in the Chomsky Hierarchy?
From what I understand, natural language are too complicated to be generated by a context-free grammar, yet parsing a context-sensitive grammar is too computationally demanding for our brain to be continuously performing. So it seems that if our…
samlaf
- 111
- 2