Kumiko Tanaka-Ishii
Biographic Data
| ID | 1001264 |
|---|---|
| NAME | Kumiko Tanaka-Ishii |
| GIVEN NAMES | Kumiko |
| FAMILY NAME | Tanaka-Ishii |
| SIGNATURE | TANAKA-ISHII K |
| AFFILIATIONS | Kumiai Chemical Industry (Japan) |
| ORCID | 0000-0003-1752-3951 |
| VERIFIED | Yes |
| TOTAL WORKS | 11 |
| TOTAL CITATIONS | 16 |
| AUTHOR COUNT | 11 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2006 |
| LATEST PUBLICATION YEAR | 2019 |
| H-INDEX | 3 |
Evaluating Computational Language Models with Scaling Properties of Natural Language
In this article, we evaluate computational models of natural language with respect to the universal statistical behaviors of natural language. Statistical mechanical analyses have revealed that natural language text is characterized by scaling properties, which quantify the global structure in the vocabulary population and the long memory of a text. We study whether five scaling properties (given by Zipf’s law, Heaps’ law, Ebeling’s method, Taylo…
Void of sign
This article examines the concept of void with the question of whether the concept forms a sign. A void in this article is defined as a spatio-temporal empty space existing in a representation. The aim of the analysis is to consider the hidden nature of signs, which cannot be highlighted only through an analysis of typical signs within social convention. As a semiotic tool to conduct the discussion, the notion of a zero sign of Lévi-Strauss is in…
Computational Constancy Measures of Texts—Yule's K and Rényi's Entropy
This article presents a mathematical and empirical verification of computational constancy measures for natural language text. A constancy measure characterizes a given text by having an invariant value for any size larger than a certain amount. The study of such measures has a 70-year history dating back to Yule's K, with the original intended application of author identification. We examine various measures proposed since Yule and reconsider re…
Sorting Texts by Readability
Sorting Texts by Readability
This article presents a novel approach for readability assessment through sorting. A comparator that judges the relative readability between two texts is generated through machine learning, and a given set of texts is sorted by this comparator. Our proposal is advantageous because it solves the problem of a lack of training data, because the construction of the comparator only requires training data annotated with two reading levels. The proposed…
Reflexivity and self-augmentation
In this article, sign and language systems are analyzed from the viewpoint of reflexivity — a system's ability to reinterpret its own output. Human and natural sign systems are reflexive, so this feature has not become an issue in the domain of semiotics. In contrast, not all computer language systems are reflexive, and analysis shows that there are degrees of reflexivity. The history of computer language systems can therefore be regarded as a jo…
Narcissus in language
Natural language as an example of a structural system is compared to programming language as a constructive system through analysis of how differently humans and computers process self-reference. An alternative handling of the halting problem in computer systems holds the key to a more natural computer environment and enables a greater understanding of human thought
Sign and the lambda-term
We examine lambda calculus as a sign system and show that it explains important properties of language. First, we verify that a lambda-term has two essential functionalities of signs — articulation and naming — and argue that a lambda-term can thus be regarded as a sign model. Then, when signs are defined by self-reference, we show that these two functionalities become tightly coupled and that dyadic/triadic sign models become equivalent. Last, w…
Icon, index, symbol and denotation, connotation, metasign
We discuss how Hjelmslev's denotation, connotation, and metasign could correspond to Peirce's icon, index, and symbol. Our argument is based on the application of both theories to the programming language problem of confusion as to whether a sign signifies a value, reference, or type
Dyadic versus triadic sign models in functional and object-oriented computer programming paradigms
The correspondence between the triadic sign model proposed by Peirce and the dyadic sign model proposed by Saussure is examined. Traditionally, it has been thought that Peirce's interpretant corresponds to Saussure's signified and Saussure's model lacks Peirce's object. However, our analysis of the two most widely used computer programming paradigms suggests that Peirce's object formally corresponds to Saussure's signified, and that Saussure's si…
Thirdness as self-reference in computing
We argue that the essence of thirdness in computing is self-reference. Our discussion is grounded on the theories of Church and Curry, which have been studied in the domain of theoretical computing. Using their theories, we show that any program can be transformed into a program consisting only of three-term relations, where the essence of the three-term relations lies in self-reference
Void of sign
This article examines the concept of void with the question of whether the concept forms a sign. A void in this article is defined as a spatio-temporal empty space existing in a representation. The aim of the analysis is to consider the hidden nature of signs, which cannot be highlighted only through an analysis of typical signs within social convention. As a semiotic tool to conduct the discussion, the notion of a zero sign of Lévi-Strauss is in…
Dyadic versus triadic sign models in functional and object-oriented computer programming paradigms
The correspondence between the triadic sign model proposed by Peirce and the dyadic sign model proposed by Saussure is examined. Traditionally, it has been thought that Peirce's interpretant corresponds to Saussure's signified and Saussure's model lacks Peirce's object. However, our analysis of the two most widely used computer programming paradigms suggests that Peirce's object formally corresponds to Saussure's signified, and that Saussure's si…
Icon, index, symbol and denotation, connotation, metasign
We discuss how Hjelmslev's denotation, connotation, and metasign could correspond to Peirce's icon, index, and symbol. Our argument is based on the application of both theories to the programming language problem of confusion as to whether a sign signifies a value, reference, or type
Thirdness as self-reference in computing
We argue that the essence of thirdness in computing is self-reference. Our discussion is grounded on the theories of Church and Curry, which have been studied in the domain of theoretical computing. Using their theories, we show that any program can be transformed into a program consisting only of three-term relations, where the essence of the three-term relations lies in self-reference
Computational Constancy Measures of Texts—Yule's K and Rényi's Entropy
This article presents a mathematical and empirical verification of computational constancy measures for natural language text. A constancy measure characterizes a given text by having an invariant value for any size larger than a certain amount. The study of such measures has a 70-year history dating back to Yule's K, with the original intended application of author identification. We examine various measures proposed since Yule and reconsider re…
Narcissus in language
Natural language as an example of a structural system is compared to programming language as a constructive system through analysis of how differently humans and computers process self-reference. An alternative handling of the halting problem in computer systems holds the key to a more natural computer environment and enables a greater understanding of human thought
Sign and the lambda-term
We examine lambda calculus as a sign system and show that it explains important properties of language. First, we verify that a lambda-term has two essential functionalities of signs — articulation and naming — and argue that a lambda-term can thus be regarded as a sign model. Then, when signs are defined by self-reference, we show that these two functionalities become tightly coupled and that dyadic/triadic sign models become equivalent. Last, w…
Dyadic versus triadic sign models in functional and object-oriented computer programming paradigms
The correspondence between the triadic sign model proposed by Peirce and the dyadic sign model proposed by Saussure is examined. Traditionally, it has been thought that Peirce's interpretant corresponds to Saussure's signified and Saussure's model lacks Peirce's object. However, our analysis of the two most widely used computer programming paradigms suggests that Peirce's object formally corresponds to Saussure's signified, and that Saussure's si…
Thirdness as self-reference in computing
We argue that the essence of thirdness in computing is self-reference. Our discussion is grounded on the theories of Church and Curry, which have been studied in the domain of theoretical computing. Using their theories, we show that any program can be transformed into a program consisting only of three-term relations, where the essence of the three-term relations lies in self-reference
Icon, index, symbol and denotation, connotation, metasign
We discuss how Hjelmslev's denotation, connotation, and metasign could correspond to Peirce's icon, index, and symbol. Our argument is based on the application of both theories to the programming language problem of confusion as to whether a sign signifies a value, reference, or type
Narcissus in language
Natural language as an example of a structural system is compared to programming language as a constructive system through analysis of how differently humans and computers process self-reference. An alternative handling of the halting problem in computer systems holds the key to a more natural computer environment and enables a greater understanding of human thought
Sign and the lambda-term
We examine lambda calculus as a sign system and show that it explains important properties of language. First, we verify that a lambda-term has two essential functionalities of signs — articulation and naming — and argue that a lambda-term can thus be regarded as a sign model. Then, when signs are defined by self-reference, we show that these two functionalities become tightly coupled and that dyadic/triadic sign models become equivalent. Last, w…
Sorting Texts by Readability
Sorting Texts by Readability
This article presents a novel approach for readability assessment through sorting. A comparator that judges the relative readability between two texts is generated through machine learning, and a given set of texts is sorted by this comparator. Our proposal is advantageous because it solves the problem of a lack of training data, because the construction of the comparator only requires training data annotated with two reading levels. The proposed…
Reflexivity and self-augmentation
In this article, sign and language systems are analyzed from the viewpoint of reflexivity — a system's ability to reinterpret its own output. Human and natural sign systems are reflexive, so this feature has not become an issue in the domain of semiotics. In contrast, not all computer language systems are reflexive, and analysis shows that there are degrees of reflexivity. The history of computer language systems can therefore be regarded as a jo…
Computational Constancy Measures of Texts—Yule's K and Rényi's Entropy
This article presents a mathematical and empirical verification of computational constancy measures for natural language text. A constancy measure characterizes a given text by having an invariant value for any size larger than a certain amount. The study of such measures has a 70-year history dating back to Yule's K, with the original intended application of author identification. We examine various measures proposed since Yule and reconsider re…
Void of sign
This article examines the concept of void with the question of whether the concept forms a sign. A void in this article is defined as a spatio-temporal empty space existing in a representation. The aim of the analysis is to consider the hidden nature of signs, which cannot be highlighted only through an analysis of typical signs within social convention. As a semiotic tool to conduct the discussion, the notion of a zero sign of Lévi-Strauss is in…
Evaluating Computational Language Models with Scaling Properties of Natural Language
In this article, we evaluate computational models of natural language with respect to the universal statistical behaviors of natural language. Statistical mechanical analyses have revealed that natural language text is characterized by scaling properties, which quantify the global structure in the vocabulary population and the long memory of a text. We study whether five scaling properties (given by Zipf’s law, Heaps’ law, Ebeling’s method, Taylo…
Computer Science (8 works) · Linguistics (7 works) · Mathematics (7 works) · Philosophy (5 works) · Programming language (5 works) · Artificial Intelligence (4 works) · Natural Language Processing Techniques (4 works) · Semiotics (4 works) · Sign (mathematics) (4 works) · Epistemology (3 works)