XQuery for Pig Latin

100%

XQuery for Pig Latin

✓ Published0🌍 Public

Last edited Mar 26, 2015

Created on Mar 26, 2015

The example shows a progression of XQuery 3.0 scripts that implement Pig Latin translation, starting from a single hardcoded word and evolving to handle full sentences with punctuation. It demonstrates functional recursion and string manipulation using core XQuery functions like `fn:substring`, `fn:replace`, `fn:string-to-codepoints`, `fn:tokenize`, and `fn:string-join`. The final version declares custom functions `local:move-letters`, `local:parse-word`, and `local:parse-sentence` to process the phrase "Will you adjust the thermometer?" into its Pig Latin equivalent, preserving sentence structure. The code highlights XQuery's ability to handle text transformation without external libraries, relying solely on its built-in string and sequence operations.

AI-generated description

Similar vizzes

Loading thumbnail…

An Alternative Pig Latin Converter

This example shows an alternative Pig Latin converter that transforms an English sentence into a custom word-transformation game. It displays a hardcoded input string, “I speak Pig Latin,” and outputs a reordered phrase. The code defines a recursive XQuery function, `local:pig-parser`, that moves the first consonant cluster to the end of each word and appends “ay,” while preserving words starting with vowels by simply adding “ay.” It uses XQuery 3.0 string functions like `fn:substring`, `fn:lower-case`, and `fn:tokenize`, with `string-join` to reassemble the final sentence from the source gist. The rendering approach is plain text output, not graphical.

CCliffordAnderson

80% match

Loading thumbnail…

Pig Latin Converter

This visualization demonstrates how an English sentence is transformed into Pig Latin, showing the word-by-word conversion process. It displays the original sentence "I speak Pig Latin" alongside its Pig Latin equivalent by applying phonetic rules to each word. The code uses the XQuery 3.0 string-join function and fn:tokenize to split the input, then iterates through each word with a for loop. It checks the first letter against a list of vowels using fn:lower-case and fn:substring, then concatenates the word parts with the "||" operator to form the translated output. The rendering approach is purely text-based, with no graphical or interactive elements.

CCliffordAnderson

79% match

Loading thumbnail…

Basic Pig Latin

This example demonstrates a simple Pig Latin converter for the word "air." It shows whether the word begins with a vowel and, if so, appends "ay" directly; otherwise, it moves the first consonant to the end before adding "ay." The XQuery code defines a word variable, checks the first letter against a list of vowels, and uses string functions like `fn:substring` and `fn:lower-case` to build the result. It relies on the XQuery 3.0 language and standard string concatenation with `||`. The source is a single gist authored by CliffordAnderson.

CCliffordAnderson

74% match

Loading thumbnail…

A little playful XQuery

This playful XQuery example transforms a user’s phrase by replacing each word with a random antonym fetched from the Oxford Dictionaries API. It demonstrates a game-like text manipulation, showing the original sentiment inverted. The code uses XQuery 3.1, the `http:send-request` and `random:integer` functions, and the MarkLogic HTTP client to query the Oxford entry endpoint. For each word, it retrieves antonym sets, picks one randomly, and falls back to the original word when no antonym exists.

CCliffordAnderson

62% match

Loading thumbnail…

XQuery Working Group Challenge

This example transforms the PROIEL treebank’s Latin New Testament XML into a sequence of verse elements, each tagged with its citation and concatenated token forms. It fetches the remote XML via `fn:doc`, extracts distinct citation parts, and filters tokens by matching `@citation-part` to build structured verses. The code uses XQuery 3.1’s element constructors and `fn:data` to output text, demonstrating a direct pipeline from hierarchical treebank data to flat verse-like text.

CCliffordAnderson

60% match

Loading thumbnail…

XQuery Full Text

This example demonstrates how XQuery 3.1 can perform full-text search and fuzzy string matching directly within a query. It shows four distinct text-processing capabilities: proximity-based word matching using the `contains text` operator with distance constraints, stop-word filtering, Levenshtein distance calculation via the `strings:levenshtein` function, and phonetic comparison using `strings:soundex`. The code relies on the XQuery standard library functions for string operations rather than external visualization libraries, highlighting the language's built-in text analytics power.

CCliffordAnderson

59% match

Loading thumbnail…

For XQuery4Humanists

This example visualizes the frequency and distribution of words extracted from a TEI-encoded poem, processing the text to remove punctuation, normalize case, and tokenize it into a list. The visualization shows the resulting word list as a simple textual display, highlighting the raw output of the XQuery processing pipeline. The code uses XQuery 3.0 functions like `fn:tokenize`, `fn:lower-case`, and `fn:replace` to clean the data, pulling the source directly from a remote XML file hosted on GitHub. The rendering relies solely on the XQuery return, with no additional JavaScript or charting libraries involved.

CCliffordAnderson

59% match

Loading thumbnail…

XQuery Puzzles from Week 1, Day 5, Session 4 of the Advanced Digital Editions NEH Institute at the University of Pittsburgh

This gallery example presents a set of XQuery 3.1 puzzle solutions designed to transform data formats. One function converts a textual date like "July 15, 2022" into an `xs:date` value by tokenizing the string and using a `switch` expression to map month names to numbers, while another script processes a sequence of dates with a `for` loop. A third function converts Roman numerals to integers, using `string-to-codepoints` and `codepoints-to-string` to iterate over characters and applying a conditional sum to handle subtractive notation. The code does not use any visualization libraries; the source is a gist by CliffordAnderson.

CCliffordAnderson

59% match