andreasjansson/wizardcoder-python-34b-v1-gguf 🔢📝❓ → 📝

▶️ 771 runs 📅 Sep 2023 ⚙️ Cog 0.8.2 🔗 GitHub ⚖️ License

code-generation text-generation

About

WizardCoder-python-34B-v1.0 with support for grammars and jsonschema

Example Output

Prompt:

Below is an instruction that describes a task. Write a response that appropriately completes the request.

Instruction:

Write a short program that counts the number of occurrences of a character in a string.

Response:

Output

def num_occurrences(c: str, s: str) -> int:
    """Counts the number of occurrences of a character c in a string s."""
    count = 0
    for char in s:
        if char == c:
            count += 1
    return count

Performance Metrics

3.99s Prediction Time

3.90s Total Time

All Input Parameters

{
  "top_k": 10,
  "top_p": 0.95,
  "prompt": "Below is an instruction that describes a task. Write a response that appropriately completes the request.\n\n### Instruction:\nWrite a short program that counts the number of occurrences of a character in a string.\n\n### Response:",
  "grammar": "root        ::= \"```python\\ndef num_occurrences(c: str, s: str) -> int:\\n    \" code \"```\"\ncode        ::= [^`()]+",
  "max_tokens": 500,
  "temperature": 0.8,
  "mirostat_mode": "Disabled",
  "repeat_penalty": 1.1,
  "mirostat_entropy": 5,
  "presence_penalty": 0,
  "frequency_penalty": 0,
  "mirostat_learning_rate": 0.1
}

Input Parameters

top_k Type: integerDefault: 10: Top K
top_p Type: numberDefault: 0.95: Top P
prompt (required) Type: string: Prompt
grammar Type: string: Grammar in GBNF format. Use either grammar or jsonschema.
jsonschema Type: string: JSON schema for the generated output. Use either grammar or jsonschema.
max_tokens Type: integerDefault: 500: Max number of tokens to return
temperature Type: numberDefault: 0.8: Temperature
mirostat_mode Default: Disabled: Mirostat sampling mode
repeat_penalty Type: numberDefault: 1.1Range: 0 - 2: Repetition penalty
mirostat_entropy Type: numberDefault: 5Range: 0 - 10: Mirostat target entropy
presence_penalty Type: numberDefault: 0Range: 0 - 2: Presence
frequency_penalty Type: numberDefault: 0Range: 0 - 2: Frequency penalty
mirostat_learning_rate Type: numberDefault: 0.1Range: 0 - 1: Mirostat learning rate, if mirostat_mode is not Disabled

Output Schema

Output

Type: array • Items Type: string

Example Execution Logs

from_string grammar:
root ::= [`] [`] [`] [p] [y] [t] [h] [o] [n] [<U+000A>] [d] [e] [f] [ ] [n] [u] [m] [_] [o] [c] [c] [u] [r] [r] [e] [n] [c] [e] [s] [(] [c] [:] [ ] [s] [t] [r] [,] [ ] [s] [:] [ ] [s] [t] [r] [)] [ ] [-] [>] [ ] [i] [n] [t] [:] [<U+000A>] [ ] [ ] [ ] [ ] code [`] [`] [`] 
code ::= code_2
code_2 ::= [^`()] code_2 | [^`()]
Prompt:
Below is an instruction that describes a task. Write a response that appropriately completes the request.
### Instruction:
Write a short program that counts the number of occurrences of a character in a string.
### Response:
Llama.generate: prefix-match hit
llama_print_timings:        load time =   323.93 ms
llama_print_timings:      sample time =   644.67 ms /    74 runs   (    8.71 ms per token,   114.79 tokens per second)
llama_print_timings: prompt eval time =     0.00 ms /     1 tokens (    0.00 ms per token,      inf tokens per second)
llama_print_timings:        eval time =  3161.00 ms /    74 runs   (   42.72 ms per token,    23.41 tokens per second)
llama_print_timings:       total time =  3983.35 ms

Version Details

Version ID: efd89f8301f7f5cdad054cbb63139c894ef64ea96dbc12b4c82a2c0c720430f8
Version Created: September 22, 2023

Run on Replicate →