Basic Pig Latin

100%

Basic Pig Latin

✓ Published0🌍 Public

Last edited Mar 23, 2015

Created on Mar 23, 2015

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.

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

77% match

Loading thumbnail…

XQuery for Pig Latin

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.

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

53% match

Loading thumbnail…

Looking up words in the OED with XQuery

This example demonstrates a playful text-rewriting process where each word in a sentence is replaced by a synonym retrieved from the Oxford Dictionaries API. It begins by sending two HTTP requests to the Oxford Dictionaries API endpoints for word definitions and synonyms, then defines a custom XQuery function that isolates the first synonym for a given word. The main logic tokenizes the input sentence and applies this synonym-lookup function iteratively, finally rejoining the substituted words into a new sentence. The visualization relies on XQuery’s HTTP client capabilities for API interaction and string manipulation functions to process the text, with no graphical rendering involved.

CCliffordAnderson

52% match

Loading thumbnail…

A working example of the Say-Howdy function

This example demonstrates a recursive function that customizes a greeting for multiple names, showing how XQuery handles string concatenation and conditional logic. The `local:say-howdy` function takes a sequence of strings, checks the count with `fn:count`, and joins multiple names with `fn:string-join` using " and " while appending an exclamation mark. The code invokes the function with a sequence of two names, "Dave" and "Laura", producing a single combined greeting. The example highlights XQuery’s type annotations (`xs:string*`) and the `if`/`else` expression, with no external libraries—purely native XQuery 3.0 syntax.

CCliffordAnderson

50% 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

48% match

Loading thumbnail…

An example of a fold function

This example demonstrates how the XQuery `fold-left` function reverses the letters of each word in a sequence, then joins the results into a single phrase. The code defines a list of words, an initial empty phrase, and an anonymous function that reverses each word using `fn:string-to-codepoints` and `fn:reverse` before converting back with `fn:codepoints-to-string`. The `fold-left` call iterates over the words, applying the function to accumulate the final string. The source is a gist by CliffordAnderson, and the output would be "tset a si siht" if the words were processed, though the phrase starts empty.

CCliffordAnderson

48% match