Raphael Finkel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Raphael Finkel has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
Adriana Peliano
1 shared publication- Agnė Zolubienė1 shared publication
Ahmed Shamim
Department of Asian Studies, University of Texas at Austin, Austin, Texas
1 shared publication- Anna Wegener
The University of Florence
1 shared publication - Bahar Eshraq1 shared publication
Barbara Simoniti
1 shared publication
Latest Publications
- 1 November 2025
- Published by Springer Nature
- p. 212-222
Answer-Set Programming - An Introduction Based on Sudoku and (Thomas G.) Room Arrangements
- 1 November 2025
- Published by Springer Nature
- p. 212-222
Answer-Set Programming - An Introduction Based on Sudoku and (Thomas G.) Room Arrangements
- 11 October 2024
- Published by Malmo University
A Companion to “Jabberwocky” in Translation
Lewis Carroll’s “Jabberwocky” stands as the most famous nonsense poem of all time. Frequently seen as untranslatable, it has nevertheless (or for that very reason) become a touchstone of translation. Yet, although there are several language specific studies of “Jabberwocky” in translation, a broader comparative approach has not been attempted before. With this companion volume we provide insights into the translation history of “Jabberwocky” from its 1871 publication in Lewis Carroll’s Through the Looking-Glass up to the present. The book includes articles by scholars, critics, translators and poets from across the world. For the first time, it will be possible to compare translation strategies and solutions between more than forty different languages, each contributor focusing on one or a few critically and poetically interesting translations of “Jabberwocky.”
- 11 October 2024
- Published by Malmo University
A Companion to “Jabberwocky” in Translation
Lewis Carroll’s “Jabberwocky” stands as the most famous nonsense poem of all time. Frequently seen as untranslatable, it has nevertheless (or for that very reason) become a touchstone of translation. Yet, although there are several language specific studies of “Jabberwocky” in translation, a broader comparative approach has not been attempted before. With this companion volume we provide insights into the translation history of “Jabberwocky” from its 1871 publication in Lewis Carroll’s Through the Looking-Glass up to the present. The book includes articles by scholars, critics, translators and poets from across the world. For the first time, it will be possible to compare translation strategies and solutions between more than forty different languages, each contributor focusing on one or a few critically and poetically interesting translations of “Jabberwocky.”
- Open Access
- 26 March 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (12) , 5765-5772
Parallel m-dimensional relative ant colony optimization (mDRACO) for the Costas-array problem
The Costas-array problem is a combinatorial constraint-satisfaction problem (CSP) that remains unsolved for many array sizes greater than 30. In order to reduce the time required to solve large instances, we present an Ant Colony Optimization algorithm called m-Dimensional Relative Ant Colony Optimization ( $$m$$ DRACO) for combinatorial CSPs, focusing specifically on the Costas-array problem. This paper introduces the optimizations included in $$m$$ DRACO, such as map-based association of pheromone with arbitrary-length component sequences and relative path storage. We assess the quality of the resulting $$m$$ DRACO framework on the Costas-array problem by computing the efficiency of its processor utilization and comparing its run time to that of an ACO framework without the new optimizations. $$m$$ DRACO gives promising results; it has efficiency greater than 0.5 and reduces time-to-first-solution for the $$m = 16$$ Costas-array problem by a factor of over 300.- 26 March 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (12) , 5765-5772
Open AccessParallel m-dimensional relative ant colony optimization (mDRACO) for the Costas-array problem
The Costas-array problem is a combinatorial constraint-satisfaction problem (CSP) that remains unsolved for many array sizes greater than 30. In order to reduce the time required to solve large instances, we present an Ant Colony Optimization algorithm called m-Dimensional Relative Ant Colony Optimization ( $$m$$ DRACO) for combinatorial CSPs, focusing specifically on the Costas-array problem. This paper introduces the optimizations included in $$m$$ DRACO, such as map-based association of pheromone with arbitrary-length component sequences and relative path storage. We assess the quality of the resulting $$m$$ DRACO framework on the Costas-array problem by computing the efficiency of its processor utilization and comparing its run time to that of an ACO framework without the new optimizations. $$m$$ DRACO gives promising results; it has efficiency greater than 0.5 and reduces time-to-first-solution for the $$m = 16$$ Costas-array problem by a factor of over 300. - Open Access
- 22 January 2022
- Published by Association for Computing Machinery (ACM) in Journal on Computing and Cultural Heritage
- Vol. 15 (1) , 1-15
Analyzing Code-mixing in Linguistic Corpora Using Kratylos
Code-switching, code-mixing, and, more generally, multilingualism pose technological challenges for language documentation, the sub-discipline of linguistics that deals with the annotation and basic analysis of field recordings and other primary data. We focus here on a case study involving code-mixing in the endangered Koda language, which poses special problems for morphosyntactic analysis. We offer a robust approach to multilingual annotations that involves a combination of the popular open source software FieldWorks Language Explorer (FLEx) with Kratylos, a web-based corpus tool for display and query. Kratylos exposes linguistic data from various formats to powerful regular-expression queries that can exploit tier structure and other aspects of interlinear glossed text. We show how Kratylos can target mixed structures in our FLEx database of Koda that cannot be easily identified within the original FLEx software itself.
- 22 January 2022
- Published by Association for Computing Machinery (ACM) in Journal on Computing and Cultural Heritage
- Vol. 15 (1) , 1-15
Open AccessAnalyzing Code-mixing in Linguistic Corpora Using Kratylos
Code-switching, code-mixing, and, more generally, multilingualism pose technological challenges for language documentation, the sub-discipline of linguistics that deals with the annotation and basic analysis of field recordings and other primary data. We focus here on a case study involving code-mixing in the endangered Koda language, which poses special problems for morphosyntactic analysis. We offer a robust approach to multilingual annotations that involves a combination of the popular open source software FieldWorks Language Explorer (FLEx) with Kratylos, a web-based corpus tool for display and query. Kratylos exposes linguistic data from various formats to powerful regular-expression queries that can exploit tier structure and other aspects of interlinear glossed text. We show how Kratylos can target mixed structures in our FLEx database of Koda that cannot be easily identified within the original FLEx software itself.
- 1 January 2017
- Published by Walter de Gruyter GmbH in Linguistic Typology
- Vol. 21 (2) , 209-260
Single versus concurrent systems: Nominal classification in Mian
The Papuan language Mian allows us to refine the typology of nominal classification. Mian has two candidate classification systems, differing completely in their formal realization but overlapping considerably in their semantics. To determine whether to analyse Mian as a single system or concurrent systems we adopt a canonical approach. Our criteria – orthogonality of the systems (we give a precise measure), semantic compositionality, morphosyntactic alignment, distribution across parts of speech, exponence, and interaction with other features – point mainly to an analysis as concurrent systems. We thus improve our analysis of Mian and make progress with the typology of nominal classification.
- 1 January 2017
- Published by Walter de Gruyter GmbH in Linguistic Typology
- Vol. 21 (2) , 209-260
Single versus concurrent systems: Nominal classification in Mian
The Papuan language Mian allows us to refine the typology of nominal classification. Mian has two candidate classification systems, differing completely in their formal realization but overlapping considerably in their semantics. To determine whether to analyse Mian as a single system or concurrent systems we adopt a canonical approach. Our criteria – orthogonality of the systems (we give a precise measure), semantic compositionality, morphosyntactic alignment, distribution across parts of speech, exponence, and interaction with other features – point mainly to an analysis as concurrent systems. We thus improve our analysis of Mian and make progress with the typology of nominal classification.
- 1 February 2011
- Published by Cambridge University Press (CUP) in Artificial Intelligence for Engineering Design, Analysis and Manufacturing
- Vol. 25 (2) , 163-174
Reasoning about conditional constraint specification problems and feature models
Product configuration is a major industrial application domain for constraint satisfaction techniques. Conditional constraint satisfaction problems (CCSPs) and feature models (FMs) have been developed to represent configuration problems in a natural way. CCSPs are like constraint satisfaction problems (CSPs), but they also include potential variables, which might or might not exist in any given solution, as well as classical variables, which are required to take a value in every solution. CCSPs model, for example, options on a car, for which the style of sunroof (a variable) only makes sense if the car has a sunroof at all. FMs are directed acyclic graphs of features with constraints on edges. FMs model, for example, cell phone features, where utility functions are required, but the particular utility function “games” is optional, but requires Java support. We show that existing techniques from formal methods and answer set programming can be used to naturally model CCSPs and FMs. We demonstrate configurators in both approaches. An advantage of these approaches is that the model builder does not have to reformulate the CCSP or FM into a classic CSP, converting potential variables into classical variables by adding a “does not exist” value and modifying the problem constraints. Our configurators automatically reason about the model itself, enumerating all solutions and discovering several kinds of model flaws.
- 1 February 2011
- Published by Cambridge University Press (CUP) in Artificial Intelligence for Engineering Design, Analysis and Manufacturing
- Vol. 25 (2) , 163-174
Reasoning about conditional constraint specification problems and feature models
Product configuration is a major industrial application domain for constraint satisfaction techniques. Conditional constraint satisfaction problems (CCSPs) and feature models (FMs) have been developed to represent configuration problems in a natural way. CCSPs are like constraint satisfaction problems (CSPs), but they also include potential variables, which might or might not exist in any given solution, as well as classical variables, which are required to take a value in every solution. CCSPs model, for example, options on a car, for which the style of sunroof (a variable) only makes sense if the car has a sunroof at all. FMs are directed acyclic graphs of features with constraints on edges. FMs model, for example, cell phone features, where utility functions are required, but the particular utility function “games” is optional, but requires Java support. We show that existing techniques from formal methods and answer set programming can be used to naturally model CCSPs and FMs. We demonstrate configurators in both approaches. An advantage of these approaches is that the model builder does not have to reformulate the CCSP or FM into a classic CSP, converting potential variables into classical variables by adding a “does not exist” value and modifying the problem constraints. Our configurators automatically reason about the model itself, enumerating all solutions and discovering several kinds of model flaws.
- 26 September 2007
- Published by Springer Nature
- p. 137-140
Reversers-A programming language construct for reversing out of code
- 26 September 2007
- Published by Springer Nature
- p. 137-140
Reversers-A programming language construct for reversing out of code
- 23 January 2007
- Published by Springer Nature in Wireless Personal Communications
- Vol. 43 (2) , 411-436
RPSF: A Routing Protocol with Selective Forwarding for Mobile Ad-Hoc Networks
- 23 January 2007
- Published by Springer Nature in Wireless Personal Communications
- Vol. 43 (2) , 411-436
RPSF: A Routing Protocol with Selective Forwarding for Mobile Ad-Hoc Networks
- 18 October 2004
- Published by Wiley in Software: Practice and Experience
- Vol. 34 (15) , 1481-1504
Constraint Lingo: towards high-level constraint programming
- 18 October 2004
- Published by Wiley in Software: Practice and Experience
- Vol. 34 (15) , 1481-1504
Constraint Lingo: towards high-level constraint programming
- 1 September 1999
- Published by Wiley in Software: Practice and Experience
- Vol. 29 (11) , 953-971
Experience with a Unix system-administration tool
- 1 September 1999
- Published by Wiley in Software: Practice and Experience
- Vol. 29 (11) , 953-971
Experience with a Unix system-administration tool